全文获取类型
收费全文 | 1093篇 |
免费 | 70篇 |
国内免费 | 132篇 |
专业分类
化学 | 50篇 |
力学 | 54篇 |
综合类 | 30篇 |
数学 | 993篇 |
物理学 | 168篇 |
出版年
2024年 | 1篇 |
2023年 | 14篇 |
2022年 | 8篇 |
2021年 | 17篇 |
2020年 | 15篇 |
2019年 | 21篇 |
2018年 | 17篇 |
2017年 | 26篇 |
2016年 | 31篇 |
2015年 | 29篇 |
2014年 | 45篇 |
2013年 | 105篇 |
2012年 | 40篇 |
2011年 | 43篇 |
2010年 | 62篇 |
2009年 | 72篇 |
2008年 | 60篇 |
2007年 | 68篇 |
2006年 | 68篇 |
2005年 | 61篇 |
2004年 | 45篇 |
2003年 | 53篇 |
2002年 | 61篇 |
2001年 | 59篇 |
2000年 | 53篇 |
1999年 | 33篇 |
1998年 | 41篇 |
1997年 | 37篇 |
1996年 | 22篇 |
1995年 | 18篇 |
1994年 | 15篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有1295条查询结果,搜索用时 15 毫秒
41.
We describe algorithms for polynomial factorization over the binary field , and their implementation. They allow polynomials of degree up to to be factored in about one day of CPU time, distributing the work on two processors.
42.
A fluctuation theory for Markov chains on an ordered countable state space is developed, using ladder processes. These are shown to be Markov renewal processes. Results are given for the joint distribution of the extremum (maximum or minimum) and the first time the extremum is achieved. Also a new classification of the states of a Markov chain is suggested. Two examples are given. 相似文献
43.
DU Beiliang WANG Jian Department of Mathematics Suzhou University Suzhou China Nantong Vocational College Nantong China 《中国科学A辑(英文版)》2004,47(3)
Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k. 相似文献
44.
J. M. Peña 《BIT Numerical Mathematics》2001,41(3):640-643
In 1999 Amodio and Mazzia presented a new backward error analysis for LU factorization and introduced a new growth factor
n
. Their very interesting approach allowed them to obtain sharp error bounds. In particular, they derive nice results assuming that partial pivoting is used. However, the forward error bound for the solution of a linear system whose coefficient matrix A is an M-atrix given in Theorem 4.1 of that paper is not correct. They first obtain a bound for the condition number (U) assuming that one has the LU factorization of an M-matrix and then they apply the bounds obtained when partial pivoting is used. But if P is the permutation associated with partial pivoting then PA = LU can fail to be an M-atrix and the bound for (U) can be false, as shown in our Example 1.1. We also prove that, for a pivoting strategy presented in the paper, the growth factor of an M-matrix A is n(A) = 1 and (U) (A), where U is the upper triangular matrix obtained after applying such a pivoting strategy.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
45.
Let G be a -compact, locally compact group and I be a closed2-sided ideal with finite codimension in L1(G). It is shownthat there are a closed left ideal L having a right boundedapproximate identity and a closed right ideal R having a leftbounded approximate identity such that I = L + R. The proofuses ideas from the theory of boundaries of random walks ongroups. 2000 Mathematics Subject Classification: primary 43A20;secondary 42A85, 43A07, 46H10, 46H40, 60B11. 相似文献
46.
47.
D. Zangurashvili 《Georgian Mathematical Journal》1999,6(2):191-200
Several results on the translation of factorization systems along adjunctions are proved. The first of these results is the answer to the question posed by G.Janelidze. 相似文献
48.
It has been recently shown that large growth factors might occur in Gaussian Elimination with Partial Pivoting (GEPP) also when solving some plausibly natural systems. In this note we argue that this potential problem could be easily solved, with much smaller risk of failure, by very small (and low cost) modifications of the basic algorithm, thus confirming its inherent robustness. To this end, we first propose an informal model with the goal of providing further support to the comprehension of the stability properties of GEPP. We then report the results of numerical experiments that confirm the viewpoint embedded in the model. Basing on the previous observations, we finally propose a simple scheme that could be turned into (even more) accurate software for the solution of linear systems. 相似文献
49.
We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms
can be performed with the help of appropriate radio-frequency pulses. In addition to the standard nearest-neighbor Ising coupling,
we also allow for a second neighbor coupling. It is shown, how to apply the 2π
k method in this more general setting, where the additional coupling eventually allows to save a few pulses. We illustrate
our results with two numerical simulations: the Shor prime factorization of the number 4 and the teleportation of a qubit
along a chain of 3 qubits. In both cases, the optimal Rabi frequency (to suppress non-resonant effects) depends primarily
on the strength of the second neighbor interaction. 相似文献
50.
主要论述n次单位根在一些组合数求和、多项式的整除、因式分解中的应用,说明了n次单位根法可拓宽解题思路,是一种方便、快捷的数学解题方法. 相似文献